Rich Colorings with Local Constraints
نویسندگان
چکیده
A new hypergraph coloring problem is introduced by de ning N(H; e) as the maximal number of colors in a vertex coloring of a hypergraph H = (V; E) , which has not more than e di erent colors in every edge. Our main results concern the asymptotic behaviour of this quantity for the uniform hypergraph H(n; `; k) = (V(n; `); E(n; `; k)) with vertex set V(n; `) = ǹ for n = f1; 2; : : : ; ng and edge set E(n; `; k) = nE = À : A 2 n k o . In case ` = 2 there are connections to Turan's graph. 2
منابع مشابه
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found using known colorings as building blocks. AMS Subject Classifications: 05D10, 05D04
متن کاملLocal k-colorings of graphs and hypergraphs
A local k-coloring of a graph is a coloring of its edges in such a way that each vertex is incident to edges of at most k different colors. We investigate the similarities and differences between usual and local k-colorings, and the results presented in the paper give a general insight to the nature of local colorings. We are mainly concerned with local variants of Ramsey-type problems, in part...
متن کاملLocal uniformity properties for glauber dynamics on graph colorings
We investigate some local properties which hold with high probability for randomly selected colorings of a fixed graph with no short cycles. We show that, when the number of colors is sufficiently large relative to the maximum degree of the graph, the aforementioned properties can be used to establish improved bounds on the mixing time for the single-site dynamics, a Markov chain for sampling c...
متن کاملGraph colorings with local constraints - a survey
Zsolt Tuza y Latest update : September 8, 1997 Abstract We survey the literature on those variants of the chromatic number problem where not only a proper coloring has to be found (i.e., adjacent vertices must not receive the same color) but some further local restrictions are imposed on the color assignment. Mostly, the list colorings and the precoloring extensions are considered. In one of th...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کامل